Graphs whose complement and square are isomorphic ( extended version )
نویسندگان
چکیده
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-complementary graphs, and characterize square-complementary graphs within various graph classes. The bipartite case turns out to be of particular interest. Acknowledgements: MM is supported in part by the Slovenian Research Agency, research program P1–0285 and research projects J1–4010, J1–4021, and N1–0011: GReGAS, supported in part by the European Science Foundation.
منابع مشابه
ON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملSome isomorphic properties of m-polar fuzzy graphs with applications
The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle m-polar fuzzy information by combining the theory of m-polar fuzzy sets with graphs. We introduce the notion of weak self complement m-polar fuzzy graphs and establish a necessary condition...
متن کاملBerge graphs with chordless cycles of bounded length
A graph is called weakly triangulated if it contains no chordless cycle on ve or more vertices (also called hole) and no complement of such a cycle (also called antihole). Equivalently, we can deene weakly triangulated graphs as antihole-free graphs whose induced cycles are isomorphic either to C3 or to C4. The perfection of weakly triangulated graphs was proved by Hayward 3] and generated inte...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013